Distinct Distances on Curves Via Rigidity
نویسنده
چکیده
It is shown that N points on a real algebraic curve of degree n in R always determine &n,d N 1+ 1 4 distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the latter case, there are arrangements of N points which determine . N distinct distances. The method may be applied to other quantities of interest to obtain analogous exponent gaps. An important step in the proof involves understanding the structural rigidity of certain frameworks on curves.
منابع مشابه
Tire track geometry: variations on a theme
We study closed smooth convex plane curves Γ enjoying the following property: a pair of points x, y can traverse Γ so that the distances between x and y along the curve and in the ambient plane do not change; such curves are called bicycle curves. Motivation for this study comes from the problem how to determine the direction of the bicycle motion by the tire tracks of the bicycle wheels; bicyc...
متن کاملDose Distribution Evaluation and Independent Quality Check of Spherical INTRABEAM™ Applicators via Radiochromic EBT2 Film Measurement
Introduction: The present study was conducted to implement a simple practical independent quality check of depth dose and isotropy of the Intrabeam™ therapeutic X-ray machine using radiochromic EBT2 film. Material and Methods: Theindependent quality check of 1.5, 3.5, and 5-cm spherical Intrabeam™ applicators was accomplished using particular EBT2 film cutting pieces with internal rounded edge...
متن کاملFew distinct distances implies no heavy lines or circles
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains Ω(n) points of P and no circle contains Ω(n) points of P . We rely on the bipartite and partial variant of the Elekes-Sharir framework that was presented by Sharir, Sheffer, and Solymosi in [2...
متن کاملClustering via Concave Minimization
w. N. Street Computer Science Department Oklahoma State University 205 Mathematical Sciences Stillwater, OK 74078 email: nstreet@es. okstate. edu The problem of assigning m points in the n-dimensional real space Rn to k clusters is formulated as that of determining k centers in Rn such that the sum of distances of each point to the nearest center is minimized. If a polyhedral distance is used, ...
متن کاملAnalysis of bacterial adhesion using a gradient force analysis method and colloid probe atomic force microscopy.
The atomic force microscope (AFM) has been used to examine the stickiness of bacteria on the basis of the analysis of approach and retraction force curves between the AFM tip and the bacterial surface. One difficulty in analyzing approach curve data is that the distance between the AFM tip and the surface of the bacterium is difficult to define. The exact distances are difficult to determine be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 51 شماره
صفحات -
تاریخ انتشار 2014